Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
نویسندگان
چکیده
We study a class of two-stage stochastic integer programs with general integer variables in both stages and finitely many realizations of the uncertain parameters. Based on Benders’ method, we propose a decomposition algorithm that utilizes Gomory cuts in both stages. The Gomory cuts for the second-stage scenario subproblems are parameterized by the first-stage decision variables, i.e., they are valid for any feasible first-stage solutions. In addition, we propose an alternative implementation that incorporates Benders’ decomposition into a branch-and-cut process in the first stage. We prove the finite convergence of the proposed algorithms. We also report our preliminary computations with a rudimentary implementation of our algorithms to illustrate their effectiveness.
منابع مشابه
Finitely Convergent Decomposition Algorithms For
We study a class of two-stage stochastic integer programs with general integer vari4 ables in both stages and finitely many realizations of the uncertain parameters. Based on Benders’ 5 method, we propose a decomposition algorithm that utilizes Gomory cuts in both stages. The Go6 mory cuts for the second-stage scenario subproblems are parameterized by the first-stage decision 7 variables, i.e.,...
متن کاملDecomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
We consider a class of two-stage stochastic integer programs with binary variables in the first stage and general integer variables in the second stage. We develop decomposition algorithms akin to the L-shaped or Benders’ methods by utilizing Gomory cuts to obtain iteratively tighter approximations of the second-stage integer programs. We show that the proposed methodology is flexible in that i...
متن کاملAncestral Benders’ Cuts and Multi-term Disjunctions for Mixed-Integer Recourse Decisions in Stochastic Programming
This paper focuses on solving two-stage stochastic mixed integer programs (SMIPs) with general mixed integer decision variables in both stages. We develop a decomposition algorithm in which the first stage approximation is solved using a branch-and-bound tree with nodes inheriting Benders’ cuts that are valid for their ancestor nodes. In addition, we develop two closely related convexification ...
متن کاملDecomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
In this paper, we introduce and study a two-stage distributionally robust mixed binary problem (TSDR-MBP) where the random parameters follow the worst-case distribution belonging to an uncertainty set of probability distributions. We present a decomposition algorithm, which utilizes distribution separation procedure and parametric cuts within Benders’ algorithm or Lshaped method, to solve TSDR-...
متن کاملOptimization Driven Scenario Grouping
Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. We develop an approach that improves upon these bounds by re-enforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into ‘groups’. Specifically, we formulate an optimization pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 24 شماره
صفحات -
تاریخ انتشار 2014